Identifying combinatorial valuations from aggregate demand

نویسندگان

  • Itai Sher
  • Kyoo il Kim
چکیده

We study identification of combinatorial valuations from aggregate demand. Each utility function takes as arguments subsets or, alternatively, quantities of the multiple goods. We exploit mathematical insights from auction theory to generically identify the distribution of utility functions. In our setting, aggregate demand for each item is observable while demand for bundles is not. Nevertheless, our identification result allows us to recover the latter.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Online Appendix for “Identifying Combinatorial Valuations from Aggregate Demand”

This Online Appendix addresses several issues mentioned but not discussed in depth in the paper. Section I discusses various extensions of the basic model. Section II shows that for our identification arguments, it is sufficient to observe aggregate demand where it is singlevalued. Section III provides a proof of part 3 of Proposition 4. Section IV provides an example that shows that the set of...

متن کامل

Exponential Communication Ine¢ ciency of Demand Queries

Nisan and Segal (forthcoming) show that when verifying the e¢ ciency of a combinatorial allocation, without increasing the communication burden one can restrict attention to announcing a price equilibrium. We …nd that a parallel conjecture for deterministic communication fails: We demonstrate a class of valuations for which the restriction to “demand queries,” which ask agents to report their p...

متن کامل

Existence of Competitive Equilibria in Combinatorial Auctions

Competitive equilibrium provides a natural steady state for iterative combinatorial auctions that maximize social welfare, and therefore the first step in auction design is to establish its existence. Recent work by Baldwin and Klemperer (2012) has proved that the "demand type" of valuations being "unimodular" is a necessary and sufficient condition for the existence of a competitive equilibriu...

متن کامل

When Are Welfare Guarantees Robust?

Computational and economic results suggest that social welfare maximization and combinatorial auction design are much easier when bidders’ valuations satisfy the “gross substitutes” condition. The goal of this paper is to evaluate rigorously the folklore belief that the main take-aways from these results remain valid in settings where the gross substitutes condition holds only approximately. We...

متن کامل

Exponential communication inefficiency of demand queries

In the problem of …nding an e¢ cient allocation when agents’utilities are privately known, we examine the e¤ect of restricting attention to mechanisms using “demand queries,” which ask agents to report an optimal allocation given a price list. We construct a combinatorial allocation problem with m items and two agents whose valuations lie in a certain class, such that (i) e¢ ciency can be obtai...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • J. Economic Theory

دوره 153  شماره 

صفحات  -

تاریخ انتشار 2014